Maintaining the duality of closeness and betweenness centrality
نویسندگان
چکیده
منابع مشابه
Further Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملThe Dynamics of Closeness and Betweenness
Although both betweenness and closeness centrality are claimed to be important for the effectiveness of someone’s network position, it has not been explicitly studied which networks emerge if actors follow incentives for these two positional advantages. We propose such a model and observe that network dynamics differ considerably in a scenario with either betweenness or closeness incentives com...
متن کاملReal Time Closeness and Betweenness Centrality Calculations on Streaming Network Data
Closeness and betweenness are among the most important metrics in social network analysis. They are essential to the evaluation of various research problems such as viral marketing, network stability and network traffic predictions, which play an important role in social media research. However, both of these metrics are expensive to compute. We propose an efficient online algorithm framework t...
متن کاملFully Dynamic Betweenness Centrality
We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν∗ · log n) time per update with our basic algorithm, and O(ν∗ · log n) time with a more complex algorithm, where n = |V |, and ν∗ bounds the number...
متن کاملBetweenness Centrality - Incremental and Faster
We present an incremental algorithm that updates the betweenness centrality (BC) score of all vertices in a graph G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O(ν∗ · n) time, where ν∗ is bounded by m∗, the number of edges that lie on a shortest path in G. We achieve the same bound for the more general incremental vertex update ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Networks
سال: 2016
ISSN: 0378-8733
DOI: 10.1016/j.socnet.2015.08.003